منابع مشابه
An Interview with Richard
[Introduction: Richard Stockton MacNeish, known to friends and colleagues as “Scotty,” was born April 29, 1918. His name has become synonymous with research into the origins of agriculture. He was educated at the University of Chicago, from which he received his Ph.D. in 1949, and focused on the prehistory of Mesoamerica. Employed by the Canadian government from 1949 to 1962, he administered it...
متن کاملInterview with Richard S. Sutton
Sutton: Well, of course there have been many. In no particular order, the ones that come to mind most quickly are: policy-gradient methods, temporal abstraction methods such as options, and the new predictive ways of thinking about state. Also important are the new Monte Carlo search methods, such as are used in Computer Go. I am also impressed by some of the new applications, such as on autono...
متن کاملQnAs with Richard Scheller. Interview by Prashant Nair.
As electrical signals course through brain cells, a stepwise process of information transfer ensures that the signals are relayed across junctions called synapses. Orchestrating the process on either side of the synaptic gulf is a suite of proteins found on neuronal membranes and on tiny vesicles that ferry signaling molecules, called neurotransmitters, across synapses. Beginning in the late 19...
متن کاملInterview with Peter Scholliers, Amy Trubek and Richard Wilk
Peter Scholliers : For the last two years I have been studying the relationship between food and health in Europe in the “long” twentieth century. My starting point is shamelessly simple: why is it that, despite increasing nutritional knowledge, stockpiling food recommendations, and manifold allegedly all-solving diets, people all over the world are getting overweight and even obese? The overwe...
متن کاملNP Completeness , Part 3 Richard Cole December 1 , 2008 1 Reduction Techniques
1.1 Generalization Quite often, a problem one wants to show NP-Complete (NPC) is a generalization of a known NPC problem. For example, the Traveling Seller problem is a generalization of the Hamiltonian Circuit Problem. Showing that the generalized problem is NPhard is trivial: the identity reduction suffices. Or to put it another way, a polynomial time algorithm for the generalized problem is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Against the Grain
سال: 1992
ISSN: 2380-176X
DOI: 10.7771/2380-176x.1290